-
1 shortest path algorithm
алгоритм поиска кратчайшего маршрута
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > shortest path algorithm
-
2 shortest path algorithm
-
3 shortest path algorithm
English-Russian big polytechnic dictionary > shortest path algorithm
-
4 shortest path algorithm
1) Техника: алгоритм нахождения кратчайшего пути2) Математика: алгоритм поиска кратчайшего маршрута (shortest route)3) Вычислительная техника: алгоритм пояска кратчайшего маршрута (в сетевых задачах)4) Механика: алгоритм поиска кратчайшего пути6) Безопасность: алгоритм кратчайшего путиУниверсальный англо-русский словарь > shortest path algorithm
-
5 shortest path algorithm
алгоритм поиска кратчайшего маршрутаБольшой англо-русский и русско-английский словарь > shortest path algorithm
-
6 shortest path algorithm
Англо-русский словарь технических терминов > shortest path algorithm
-
7 shortest-path algorithm
Техника: алгоритм нахождения кратчайшего путиУниверсальный англо-русский словарь > shortest-path algorithm
-
8 shortest path algorithm
Англо-русский словарь по машиностроению > shortest path algorithm
-
9 shortest path algorithm
Англо-русский словарь по компьютерной безопасности > shortest path algorithm
-
10 shortest path algorithm
English-Russian electronics dictionary > shortest path algorithm
-
11 shortest path algorithm
The New English-Russian Dictionary of Radio-electronics > shortest path algorithm
-
12 shortest path algorithm
English-Russian dictionary of computer science and programming > shortest path algorithm
-
13 shortest path algorithm
algorytm znajdowania najkrótszej ścieżkiEnglish-Polish dictionary for engineers > shortest path algorithm
-
14 shortest path algorithm
algorytm znajdowania najkrótszej ścieżkiEnglish-Polish dictionary of Electronics and Computer Science > shortest path algorithm
-
15 shortest path algorithm
Англо-русский словарь по робототехнике > shortest path algorithm
-
16 shortest-path algorithm
s.algoritmo del camino más corto. -
17 shortest path algorithm
English-Russian scientific dictionary > shortest path algorithm
-
18 shortest path algorithm
English-Russian information technology > shortest path algorithm
-
19 shortest path algorithm
English-Ukrainian dictionary of aviation terms > shortest path algorithm
-
20 shortest path first algorithm
Компьютерная техника: алгоритм маршрутизации по первому наикратчайшему путиУниверсальный англо-русский словарь > shortest path first algorithm
- 1
- 2
См. также в других словарях:
Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… … Wikipedia
Shortest path tree — A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph constructed so that the distance between a selected root node and all other nodes is minimal. It is a tree because if there are two paths between the root… … Wikipedia
shortest-path routing — A routing algorithm in which paths to all network destinations are calculated. The shortest path is then determined by a cost assigned to each link … Dictionary of networking
Edge disjoint shortest pair algorithm — is an algorithm in computer network routing for generating the shortest pair of edge disjoint paths between a given pair of vertices as follows:* Run the shortest pair algorithm for the given pair of vertices * Replace each edge of the shortest… … Wikipedia
Constrained Shortest Path First — (CSPF) is an extension of shortest path algorithms. The path computed using CSPF is a shortest path fulfilling a set of constraints. It simply means that it runs shortest path algorithm after pruning those links that violate a given set of… … Wikipedia
Open Shortest Path First — (OSPF) is an adaptive routing protocol for Internet Protocol (IP) networks. It uses a link state routing algorithm and falls into the group of interior routing protocols, operating within a single autonomous system (AS). It is defined as OSPF… … Wikipedia
All pairs shortest path — Finding all pairs shortest path consists of finding the shortest distance between every pair of nodes in a possibly directed graph. Various means of doing so are known, and the following list gives a few of the common methods: *Floyd Warshall… … Wikipedia
Open Shortest Path First — (frecuentemente abreviado OSPF) es un protocolo de enrutamiento jerárquico de pasarela interior o IGP (Interior Gateway Protocol), que usa el algoritmo Dijkstra enlace estado (LSA Link State Algorithm) para calcular la ruta más corta posible. Usa … Wikipedia Español
Open Shortest Path First — (frecuentemente abreviado OSPF) es un protocolo de encaminamiento jerárquico de pasarela interior o IGP (Interior Gateway Protocol), que usa el algoritmo Dijkstra enlace estado (LSA Link State Algorithm) para calcular la ruta más corta posible.… … Enciclopedia Universal
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
